Low rank perturbations of strongly definitizable transformations and matrix polynomials
نویسندگان
چکیده
منابع مشابه
Higher rank numerical ranges of rectangular matrix polynomials
In this paper, the notion of rank-k numerical range of rectangular complex matrix polynomials are introduced. Some algebraic and geometrical properties are investigated. Moreover, for ϵ > 0; the notion of Birkhoff-James approximate orthogonality sets for ϵ-higher rank numerical ranges of rectangular matrix polynomials is also introduced and studied. The proposed denitions yield a natural genera...
متن کاملApproximating the Covariance Matrix of GMMs with Low-Rank Perturbations
Covariance matrices capture correlations that are invaluable in modeling real-life datasets. Using all d elements of the covariance (in d dimensions) is costly and could result in over-fitting; and the simple diagonal approximation can be over-restrictive. In this work, we present a new model, the Low-Rank Gaussian Mixture Model (LRGMM), for modeling data which can be extended to identifying pa...
متن کاملApproximating the Covariance Matrix with Low-rank Perturbations
Covariance matrices capture correlations that are invaluable in modeling real-life datasets. Using all d elements of the covariance (in d dimensions) is costly and could result in over-fitting; and the simple diagonal approximation can be over-restrictive. We present an algorithm that improves upon the diagonal matrix by allowing a low rank perturbation. The efficiency is comparable to the diag...
متن کاملStrongly Damped Quadratic Matrix Polynomials
We study the eigenvalues and eigenspaces of the quadratic matrix polynomial Mλ + sDλ + K as s → ∞, where M and K are symmetric positive definite and D is symmetric positive semi-definite. The work is motivated by its application to modal analysis of finite element models with strong linear damping. Our results yield a mathematical explanation of why too strong damping may lead to practically un...
متن کاملDecomposing multivariate polynomials with structured low-rank matrix completion
We are focused on numerical methods for decomposing a multivariate polynomial as a sum of univariate polynomials in linear forms. The main tool is the recent result on correspondence between the Waring rank of a homogeneous polynomial and the rank of a partially known quasi-Hankel matrix constructed from the coefficients of the polynomial. Based on this correspondence, we show that the original...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 1994
ISSN: 0024-3795
DOI: 10.1016/0024-3795(94)90479-0